Your selections:
Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Fellows, Michael R., Fertin, Guillaume, Hermelin, Danny, Vialette, Stephane
W-Hierarchies defined by symmetric gates
- Fellows, Michael, Flum, Jörg, Hermelin, Danny, Müller, Moritz, Rosamond, Frances
Haplotype inference constrained by plausible haplotype data
- Fellows, Michael R., Hartman, Tzvika, Hermelin, Danny, Landau, Gad M., Rosamond, Frances, Rozenberg, Liat
On problems without polynomial kernels
- Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., Hermelin, Danny
On the parameterized complexity of multiple-interval graph problems
- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane
Well-quasi-orders in subclasses of bounded treewidth graphs
- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances A.
A purely democratic characterization of W[1]
- Fellows, Michael, Hermelin, Danny, Muller, Moritz, Rosamond, Frances
On problems without polynomial kernels
- Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., Hermelin, Danny
Are you sure you would like to clear your session, including search history and login status?